Limit points of normalized prime gaps

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limit points for normalized Laplacian eigenvalues

Limit points for the positive eigenvalues of the normalized Laplacian matrix of a graph are considered. Specifically, it is shown that the set of limit points for the j-th smallest such eigenvalues is equal to [0, 1], while the set of limit points for the j-th largest such eigenvalues is equal to [1, 2]. Limit points for certain functions of the eigenvalues, motivated by considerations for rand...

متن کامل

Gaps between Prime Numbers

Let dn = Pn+i ~Pn denote the nth gap in the sequence of primes. We show that for every fixed integer A; and sufficiently large T the set of limit points of the sequence {(dn/logra, ■ • • ,dn+k-i/logn)} in the cube [0, T]k has Lebesgue measure > c(k)Tk, where c(k) is a positive constant depending only on k. This generalizes a result of Ricci and answers a question of Erdös, who had asked to prov...

متن کامل

Limit of Normalized Quadrangulations: the Brownian map

Consider qn a random pointed quadrangulation chosen equally likely among the pointed quadrangulations with n faces. In this paper we show that, when n goes to +∞, qn suitably normalized converges weakly in a certain sense to a random limit object, which is continuous and compact, and that we name the Brownian map. The same result is shown for a model of rooted quadrangulations and for some mode...

متن کامل

New maximal prime gaps and first occurrences

The search for first occurrences of prime gaps and maximal prime gaps is extended to 1015. New maximal prime gaps of 806 and 906 are found, and sixty-two previously unpublished first occurrences are found for gaps varying from 676 to 906.

متن کامل

Large Gaps between Consecutive Prime Numbers

Let G(X) denote the size of the largest gap between consecutive primes below X . Answering a question of Erdős, we show that G(X) > f(X) logX log logX log log log logX (log log logX) , where f(X) is a function tending to infinity with X . Our proof combines existing arguments with a random construction covering a set of primes by arithmetic progressions. As such, we rely on recent work on the e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the London Mathematical Society

سال: 2020

ISSN: 0024-6107,1469-7750

DOI: 10.1112/jlms.12314